Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
711	A BASIS FOR A MATHEMATICAL THEORY OF COMPUTATION∗ JOHN McCARTHY 1961–1963 [This 1963 paper was included in Computer Programming and Formal Systems, edited by P. Braffort and D. Hirshberg and published by North-Hollan Add to Reading List Source URL: www-formal.stanford.edu Language: English - Date: 2002-03-26 18:08:23 Theoretical computer science Theory of computation Functions and mappings Function Computable function Logical connective Computability Indeterminate form Universal quantification Computability theory Mathematics Mathematical logic
712	On complexity of the quantum Ising model Sergey Bravyi∗ Matthew Hastings† Abstract Add to Reading List Source URL: www.quantum-lab.org Language: English - Date: 2014-11-28 23:30:58 Applied mathematics Adiabatic quantum computation QMA Quantum computer Quantum annealing Perturbation theory Quantum field theory Continuous quantum computation Theoretical computer science Physics Quantum mechanics
713	The Turing Closure of an Archimedean Field Paolo Boldi∗ Sebastiano Vigna∗ Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:52:19 Applied mathematics Theory of computation Alan Turing Models of computation Turing machine Computability Turing degree Computable number Reduction Theoretical computer science Computability theory Computer science
714	Advances in Abstract Categorial Grammars: Language Theory and Linguistic Modeling Makoto Kanazawa National Institue of Informatics Tokyo, Japan http://research.nii.ac.jp/˜kanazawa/ Add to Reading List Source URL: www.loria.fr Language: English - Date: 2009-07-29 20:41:55 Mathematics Applied mathematics Categorial grammar Lambda calculus Context-sensitive grammar Orbifold Formal languages Theoretical computer science Models of computation
715	1 In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond Paolo Boldi Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2013-08-12 06:22:34 Theoretical computer science Networks Network analysis Algebraic graph theory Centrality Shortest path problem Network science Power graph analysis Graph theory Mathematics Network theory
716	Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) Compilation of extended recursion in call-by-value functional languages Tom Hirschowitz · Xavier Leroy · J. B. Wells Add to Reading List Source URL: gallium.inria.fr Language: English - Date: 2009-12-15 04:49:16 Computability theory Recursion Theoretical computer science Models of computation Formal methods Lambda calculus Standard ML Free variables and bound variables Scheme Software engineering Computing Mathematics
717	Greedy Regular Expression Matching Alain Frisch1,2,? and Luca Cardelli3 2 1 ´ Ecole Normale Sup´erieure (Paris) Add to Reading List Source URL: www.cduce.org Language: English - Date: 2013-12-06 16:18:28 Software engineering Computing Models of computation Nondeterministic finite automaton Regular language FO Regular expression J Deterministic finite automaton Automata theory Formal languages Theoretical computer science
718	λ-Calculus: Then & Now Dana S. Scott University Professor Emeritus Carnegie Mellon University Add to Reading List Source URL: logic.berkeley.edu Language: English - Date: 2014-08-24 16:43:20 Computability theory Theory of computation Lambda calculus Formal methods Models of computation Combinatory logic Church–Turing thesis Turing machine Entscheidungsproblem Mathematics Theoretical computer science Mathematical logic
719	Refinement Checking of Self-Adaptive Embedded Component Architectures∗ Christian Heinzemann, Stefan Henkler Martin Hirsch Add to Reading List Source URL: www.fujaba.de Language: English - Date: 2011-11-08 14:36:31 Automata theory Diagrams UML diagrams Digital electronics Computing UML state machine State diagram Graph rewriting Finite-state machine Models of computation Software engineering Theoretical computer science
720	UNIVERSITY OF CALIFORNIA, RIVERSIDE DEPARTMENT OF COMPUTER SCIENCE 2006 DEPTH EXAMINATION IN THEORY OF OF COMPUTATION AND ALGORITHMS • There are 10 problems on the test. Each problem is worth 10 points. The ordering o Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2007-02-09 21:58:07 NP Time complexity P FL FO Turing machine Computational complexity theory Theoretical computer science Applied mathematics Complexity classes

UPDATE